<?xml version="1.0" encoding="ISO-8859-1"?>
<metadatalist>
	<metadata ReferenceType="Conference Proceedings">
		<site>sibgrapi.sid.inpe.br 802</site>
		<holdercode>{ibi 8JMKD3MGPEW34M/46T9EHH}</holdercode>
		<identifier>6qtX3pFwXQZeBBx/w5vee</identifier>
		<repository>sid.inpe.br/banon/2002/11.06.12.18</repository>
		<lastupdate>2002:11.06.02.00.00 sid.inpe.br/banon/2001/03.30.15.38 administrator</lastupdate>
		<metadatarepository>sid.inpe.br/banon/2002/11.06.12.18.09</metadatarepository>
		<metadatalastupdate>2022:06.14.00.12.10 sid.inpe.br/banon/2001/03.30.15.38 administrator {D 2000}</metadatalastupdate>
		<doi>10.1109/SIBGRA.2000.883918</doi>
		<citationkey>FabrisAssiForr:2000:PaFiAl</citationkey>
		<title>Parallelization of filling algorithms on distributed memory machines using the point containment paradigm</title>
		<year>2000</year>
		<numberoffiles>1</numberoffiles>
		<size>520 KiB</size>
		<author>Fabris, Antonio Elias,</author>
		<author>Assis, Marcos Machado Ottani,</author>
		<author>Forrest, A. Robin,</author>
		<editor>Carvalho, Paulo Cezar Pinto,</editor>
		<editor>Walter, Marcelo,</editor>
		<conferencename>Brazilian Symposium on Computer Graphics and Image Processing, 13 (SIBGRAPI)</conferencename>
		<conferencelocation>Gramado, RS, Brazil</conferencelocation>
		<date>17-20 Oct. 2000</date>
		<publisher>IEEE Computer Society</publisher>
		<publisheraddress>Los Alamitos</publisheraddress>
		<pages>235-242</pages>
		<booktitle>Proceedings</booktitle>
		<tertiarytype>Full Paper</tertiarytype>
		<organization>SBC - Brazilian Computer Society</organization>
		<transferableflag>1</transferableflag>
		<versiontype>finaldraft</versiontype>
		<keywords>parallel algorithms, filling algorithm parallelization, distributed memory machines, point containment paradigm, point containment predicate, mathematically well-defined object, computer graphics, point-driven algorithms, parallel configurations, point-driven algorithm, standard uniprocessor software implementation, interactive editing.</keywords>
		<abstract>The point containment predicate which specifies if a point is part of a mathematically well-defined object is a crucial problem in computer graphics. Point-driven algorithms can be executed for several points in parallel as there is no interdependence among the computations for different points. The paper presents a variety of parallel configurations to counteract the main disadvantage of the point-driven algorithm: its slowness on a standard uniprocessor software implementation for interactive editing and manipulation.</abstract>
		<targetfile>235-242.pdf</targetfile>
		<usergroup>administrator</usergroup>
		<visibility>shown</visibility>
		<nexthigherunit>8JMKD3MGPEW34M/46PN6AP</nexthigherunit>
		<nexthigherunit>8JMKD3MGPEW34M/4742MCS</nexthigherunit>
		<citingitemlist>sid.inpe.br/sibgrapi/2022/04.27.03.08 5</citingitemlist>
		<citingitemlist>sid.inpe.br/sibgrapi/2022/06.10.21.49 1</citingitemlist>
		<hostcollection>sid.inpe.br/banon/2001/03.30.15.38</hostcollection>
		<notes>The conference was held in Gramado, RS, Brazil, from October 17 to 20.</notes>
		<lasthostcollection>sid.inpe.br/banon/2001/03.30.15.38</lasthostcollection>
		<url>http://sibgrapi.sid.inpe.br/rep-/sid.inpe.br/banon/2002/11.06.12.18</url>
	</metadata>
</metadatalist>